Symbolic protocol analysis for monoidal equational theories
نویسندگان
چکیده
منابع مشابه
Symbolic protocol analysis for monoidal equational theories
We consider the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we take into account some algebraic properties satisfied by the operators involved in the protocol. This leads to a more realistic model than what we get under the perfect cryptography assumption, but it implies that protocol analy...
متن کاملDeciding Knowledge in Security Protocols for Monoidal Equational Theories
In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, . . . ). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Only few...
متن کاملEffective Symbolic Protocol Analysis via Equational Irreducibility Conditions
We address a problem that arises in cryptographic protocol analysis when the equational properties of the cryptosystem are taken into account: in many situations it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the equational theory. We give a tool-independent methodology for state exploration, based on unification and narro...
متن کاملDisabling equational theories in unification for cryptographic protocol analysis through tagging
Most of the research on protocol security in the past two decades has been conducted assuming a free message algebra. However, operators such as Exclusive-OR (XOR) possess algebraic properties. There were instances when a protocol was secure in the free algebra, but insecure in the presence of equational theories induced by such operators [10]. Hence, it is important to conduct protocol analysi...
متن کاملEquational Theories for Inductive Types
This paper provides characterisations of the equational theory of the per model of a typed lambda calculus with inductive types. The characterisation may be cast as a full abstraction result; in other words we show that the equations between terms valid in this model coincides with a certain syntactically defined equivalence relation. Along the way we give other characterisations of this equiva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2008
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.07.005